Inferring Waypoints Using Shortest Paths
نویسندگان
چکیده
We present a method for reconstructing intermediate destinations from a GPS trace of a multi-part trip, without access to aggregated statistics or datasets of previous traces. The method uses repeated forwards and backwards shortest-path searches. We evaluate the algorithm empirically on multi-part trips on real route maps. We show that the algorithm can achieve up to 97% recall, and that the algorithm degrades gracefully as the GPS traces become sparse and irregular.
منابع مشابه
Dave Mount CMSC 425 : Lecture 18 Artificial Intelligence for Games : Finding Paths
Recap: In the previous lecture, we discussed a technique for reducing the motion of an general object amidst a set of obstacles to the motion of a single point (in configuration space) among a collection configuration-obstacles, or C-obstacles. Since computing paths in a general geometric domain is difficult, we also presented technique for mapping the problem into one involving graphs. This in...
متن کاملBounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization
We consider the problem of computing shortest paths having curvature at most one almost everywhere and visiting a sequence of n points in the plane in a given order. This problem is a sub-problem of the Dubins Traveling Salesman Problem and also arises naturally in path planning for point car-like robots in the presence of polygonal obstacles. We show that when consecutive waypoints are distanc...
متن کاملEfficient Inference of AS-Level Paths in the Internet
Routing protocols maintain connectivity of Internet routers and hosts and determine the path that a packet traverses. Inferring Internet paths is critical for evaluating the performance of Internet applications and services, such as cloud services and content delivery. Unlike intra-domain routing protocols, which typically use the shortest paths, inte-domain routing protocol apply local policie...
متن کاملReference Path Generation and Obstacle Avoidance for Autonomous Vehicles Based on Waypoints, Dubins Curves and Virtual Force Field Method
In this study, reference path generation based on waypoints, Dubins curves and obstacle avoidance are focused. The motion of a wheeled robot vehicle is modeled by following the principles of point mass approach. While motion planning is performed, the importance of obtaining the shortest distance between two target points is illustrated. Dubins curves and waypoints are used to construct an opti...
متن کاملCoordinated UAV Manoeuvring Flight Formation
A methodology is presented for real-time control of unmanned aerial vehicles (UAV) in the absence of apriori knowledge of location of sites in an inhospitable flight territory. Our proposed hostile control methodology generates a sequence of waypoints to be pursued on the way to the target. Waypoints are continually computed with new information about the nature of changing threat. The Dijkstra...
متن کامل